#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
double l[1500];
double r[1500];
int main() {
int n, k;
cin >> n >> k;
vector <int> a(n), t(k, 0);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int ptr = 0;
int s = 0;
while (ptr < n) {
for (int j = 0; j < k && ptr < n; ++j) {
if (t[j] != 0) {
t[j]--;
}
if (t[j] == 0) {
t[j] = a[ptr];
l[ptr] = s;
r[ptr] = s + a[ptr];
ptr++;
}
}
s++;
}
vector <int> tm;
for (int i = 0; i < n; ++i)
tm.push_back(r[i]);
sort(tm.begin(), tm.end());
set <int> ans;
double zn = n;
for (int i = 0; i < n; ++i) {
int test = 1;
for (int j = l[i]; j < r[i]; ++j) {
double cnt = 0;
for (int k = 0; k < tm.size(); ++k) {
if (tm[k] > j)
break;
cnt++;
}
double ch = round(100 * (cnt / zn));
if (ch == test) {
ans.insert(i);
}
++test;
}
}
cout << ans.size();
}
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |